t-Spanners for metric space searching

نویسندگان

  • Gonzalo Navarro
  • Rodrigo Paredes
  • Edgar Chávez
چکیده

The problem of Proximity Searching in Metric Spaces consists in finding the elements of a set which are close to a given query under some similarity criterion. In this paper we present a new methodology to solve this problem, which uses a t-spanner G′(V,E) as the representation of the metric database. A t-spanner is a subgraph G′(V,E) of a graph G(V,A), such that E ⊆ A and G′ approximates the shortest path costs over G within a precision factor t. Our key idea is to regard the t-spanner as an approximation to the complete graph of distances among the objects, and to use it as a compact device to simulate the large matrix of distances required by successful search algorithms such as AESA. The t-spanner properties imply that we can use shortest paths over G′ to estimate any distance with bounded error factor t. For this sake, several t-spanner construction, updating, and search algorithms are proposed and experimentally evaluated. We show that our technique is competitive against current approaches. For example, in a metric space of documents our search time is only 9% over AESA, yet we need just 4% of its space requirement. Similar results are obtained in other metric spaces. Finally, we conjecture that the essential metric space property to obtain good tspanner performance is the existence of clusters of elements, and enough empirical evidence is given to support this claim. This property holds in most real-world metric spaces, so we expect that t-spanners will display good behavior in most practical applications. Furthermore, we show that t-spanners have a great potential for improvements.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

t-Spanners as a Data Structure for Metric Space Searching

A t-spanner, a subgraph that approximates graph distances within a precision factor t, is a well known concept in graph theory. In this paper we use it in a novel way, namely as a data structure for searching metric spaces. The key idea is to consider the t-spanner as an approximation of the complete graph of distances among the objects, and use it as a compact device to simulate the large matr...

متن کامل

Construction of Minimum-Weight Spanners

Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching and message distribution in networks. These applications use some variant of the socalled greedy algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Gre...

متن کامل

Proximal Navigation Graphs and t-spanners

Let (X,d) be a metric space, V ⊆ X a finite set, and E ⊆ V × V . We call the graph G(E, V ) a metric graph if each edge (u, v) ∈ E has weight d(u, v). In particular edge (u, u) is in the graph and have distance 0. We call G a proximal navigation graph or PN-graph if for each edge (u, v) ∈ E either u = v or there is a node u1 such that (u, u1) ∈ E and d(u, v) > d(u1, v). In such graph it is poss...

متن کامل

Practical Construction of Metric t - Spanners ∗ Gonzalo

Let G(V,A) be a connected graph with a nonnegative cost function d : A → R. Let dG(u, v) be the cost of the cheapest path between u, v ∈ V . A tspanner of G is a subgraph G(V,E), E ⊆ A, such that ∀ u, v ∈ V, dG′(u, v) ≤ t · dG(u, v), t > 1. We focus on the metric space context, which means that A = V ×V , d is a metric, and t ≤ 2. Several algorithms to build t-spanners are known, but they do no...

متن کامل

Near Isometric Terminal Embeddings for Doubling Metrics

Given a metric space (X, d), a set of terminals K ⊆ X , and a parameter t ≥ 1, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs inK ×X up to a factor of t, and have small size (e.g. number of edges for spanners, dimension for embeddings). While such terminal (aka source-wise) metric structures are known to exist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Data Knowl. Eng.

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2007